A Dynamic Multi-Swarm Particle Swarm Optimization With Global Detection Mechanism
نویسندگان
چکیده
To overcome the shortcomings of standard particle swarm optimization algorithm (PSO), such as premature convergence and low precision, a dynamic multi-swarm PSO with global detection mechanism (DMS-PSO-GD) is proposed. In DMS-PSO-GD, whole population divided into two kinds sub-swarms: several same-sized sub-swarms sub-swarm. The achieve information interaction sharing among themselves through randomly regrouping strategy. sub-swarm evolves independently learns from optimal individuals dominant characteristics. During evolution process population, variances average fitness values are used for measuring distribution particles, by which one individual can be detected easily. comparison results DMS-PSO-GD other 5 well-known algorithms suggest that it demonstrates superior performance solving different types functions.
منابع مشابه
Dynamic Multi-swarm Particle Swarm Optimization with Fractional Global Best Formation
Particle swarm optimization (PSO) has been initially proposed as an optimization technique for static environments; however, many real problems are dynamic, meaning that the environment and the characteristics of the global optimum can change over time. Thanks to its stochastic and population based nature, PSO can avoid being trapped in local optima and find the global optimum. However, this is...
متن کاملMulti swarm bare bones particle swarm optimization with distribution adaption
Bare bones PSO is a simple swarm optimization approach that uses a probability distribution like Gaussian distribution in the position update rules. However, due to its nature, Bare bones PSO is highly prone to premature convergence and stagnation. The characteristics of the probability distribution functions used in the update rule have a tense impact on the performance of the bare bones PSO. ...
متن کاملA novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization
Optimization in dynamic environment is considered amongst prominent optimization problems. There are particular challenges for optimization in dynamic environments, so that the designed algorithms must conquer the challenges in order to perform an efficient optimization. In this paper, a novel optimization algorithm in dynamic environments was proposed based on particle swarm optimization appro...
متن کاملMulti-strategy ensemble particle swarm optimization for dynamic optimization
Optimization in dynamic environments is important in real-world applications, which requires the optimization algorithms to be able to find and track the changing optimum efficiently over time. Among various algorithms for dynamic optimization, particle swarm optimization algorithms (PSOs) are attracting more and more attentions in recent years, due to their ability of keeping good balance betw...
متن کاملParticle swarm and simulated annealing for multi-global optimization
Particle swarm and simulated annealing optimization algorithms proved to be valid in finding a global optimum in the bound constrained optimization context. However, their original versions can only detect one global optimum even if the problem has more than one solution. In this paper we propose modifications to both algorithms. In the particle swarm optimization algorithm we introduce gradien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Cognitive Informatics and Natural Intelligence
سال: 2022
ISSN: ['1557-3958', '1557-3966']
DOI: https://doi.org/10.4018/ijcini.294566